A Parallel Inexact Newton Method for Stochastic Programs with Recourse

نویسنده

  • Xiaojun Chen
چکیده

A parallel inexact Newton method with a line search is proposed for two-stage quadratic stochastic programs with recourse. A lattice rule is used for the numerical evaluation of multi-dimensional integrals, and a parallel iterative method is used to solve the quadratic programming subproblems. Although the objective only has a locally Lipschitz gradient, global convergence and local superlinear convergence of the method are established. Furthermore, the method provides an error estimate which does not require much extra computation. The performance of the method is illustrated on a CM5 parallel computer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Stochastic Newton Method forStochastic Quadratic Programs with Recourse 1

In this paper, we combine the inexact Newton method with the stochastic decomposition method and present a stochastic Newton method for solving two-stage stochastic programs. We prove that the new method is globally convergent and, if in addition, an integral approximation error bound condition holds, the convergence is superlinear (with probability one for random integration rules). The error ...

متن کامل

A Stochastic Newton Method for Stochastic Quadratic Programs with Recourse

In this paper, we combine the inexact Newton method with the stochastic decomposition method and present a stochastic Newton method for solving the two-stage stochastic program. We prove that the new method is superlinearly convergent with probability one and a probabilistic error bound h(N k). The error bound h(N k) at least has the same order as jjy k ?y jj when k ! 1. In the algorithm, we ca...

متن کامل

Parallel Interior-Point Method for Linear and Quadratic Programs with Special Structure

This paper concerns the use of iterative solvers in interiorpoint methods for linear and quadratic programming problems. We state an adaptive termination rule for the inner iterative scheme and we prove the global convergence of the obtained algorithm, exploiting the theory developed for inexact Newton methods. This approach is promising for problems with special structure on parallel computers...

متن کامل

Random Test Problems and Parallel Methods for Quadratic Programs and Quadratic Stochastic Programs

This paper proposes a data parallel procedure for randomly generating test problems for two-stage quadratic stochastic programming. Multiple quadratic programs in the second stage are randomly generated in parallel. A solution of the quadratic stochastic program is determined by multiple symmetric linear complementarity problems. The procedure allows the user to specify the size of the problem,...

متن کامل

Newton - Type Methods for Stochastic

Stochastic programming is concerned with practical procedures for decision-making under uncertainty , by modelling uncertainties and risks associated with decisions in a form suitable for optimization. The eld is developing rapidly with contributions from many disciplines such as operations research, probability and statistics, and economics. A stochastic linear program with recourse can equiva...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996